Slepian-Wolf Cooperation: A Practical and Efficient Compress-and-Forward Relay Scheme

نویسندگان

  • Jing Li
  • Ruiyuan Hu
چکیده

The Slepian-Wolf (SW) cooperation proposed in [1] is probably the first practical cooperative scheme that implements the idea of compress-and-forward. Through the exploitation of efficient distributed source coding (DSC) technology, the authors of [1] demonstrate the effectiveness of Slepian-Wolf cooperation in combating inter-user channel outage in wireless environment. In this paper, we discuss the general framework of Slepian-Wolf cooperation using the two most popular DSC technologies: the binning/syndrome approach and the parity approach. We show that the latter is particularly useful in SW cooperation, since it is conceptually simpler, provides certain performance advantages, and enables any (system) linear channel code to be readily exploited. Examples using convolutional codes, low-density generator-matrix codes and low-density paritycheck codes are demonstrated and practical algorithms for estimating the source-relay correlation and for decoding the compound packets at the destination are discussed.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Design of Nested LDGM-LDPC Codes for Compress-and-Forward in Relay Channel

A three terminal relay system with binary erasure channel (BEC) was considered, in which a source forwarded information to a destination with a relay’s ”assistance”. The nested LDGM (Low-density generator-matrix) -LDPC (lowdensity parity-check) was designed to realize Compress-andforward (CF) at the relay. LDGM coding compressed the received signals losslessly and LDPC realized the binning for ...

متن کامل

Generalized Compute-Compress-and-Forward

Compute-and-forward (CF) harnesses interference in wireless communications by exploiting structured coding. The key idea of CF is to compute integer combinations of codewords from multiple source nodes, rather than to decode individual codewords by treating others as noise. Compute-compress-and-forward (CCF) can further enhance the network performance by introducing compression operations at re...

متن کامل

Slepian-Wolf Coding Over Cooperative Relay Networks

This paper deals with the problem of multicasting a set of discrete memoryless correlated sources (DMCS) over a cooperative relay network. Necessary conditions with cut-set interpretation are presented. A Joint source-Wyner-Ziv encoding/sliding window decoding scheme is proposed, in which decoding at each receiver is done with respect to an ordered partition of other nodes. For each ordered par...

متن کامل

Efficient Power Allocation for Multiple Relays with Lossy Intra-Links and Distributed Source Coding

The so-called Chief Executive Officer problem has inspired some relay transmission schemes. It suggests that the source message can be recovered at the destination by combining a set of corrupted replicas sent by multiple relays, as long as the replicas are sufficiently correlated with the original message. In this work, we build on the Slepian-Wolf theorem to assess the outage performance of a...

متن کامل

A practical scheduling and power/constellation allocation for three relay networks

Relays are being deployed in both fourth generation cellular systems and wide metropolitan area networks in order to increase coverage and spectral efficiency. In this article, we consider a network with three half-duplex relays assisting the transmission from a source towards a destination. By assuming that transmission time consists of a sequence of phases, we develop a transmission scheme in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005